Algorithm for generation pseudo-random series with arbitrarily assigned distribution law

On a decentralized trustless pseudo-random number generation algorithm

We construct an algorithm that permits a large group of individuals to reach consensus on a random number, without having to rely on any third parties. The algorithm works with high probability if there are less than 50% of colluding parties in the group. We describe also some modifications and generalizations of the algorithm.

Circular law for random matrices with unconditional log-concave distribution

We explore the validity of the circular law for random matrices with non i.i.d. entries. Let A be a random n×n real matrix having as a random vector in Rn×n a log-concave isotropic unconditional law. In particular, the entries are uncorellated and have a symmetric law of zero mean and unit variance. This allows for some dependence and non equidistribution among the entries, while keeping the sp...

Generation of Pseudo-Random Power-Law Noise Sequences by Spectral Shaping

Since the beginning, simulation has been an essential tool for assessing the performance of synchronization networks and of stand-alone clocks. In this paper, the issue of simulating the clock noise process in the time domain, by generating pseudo-random sequences having specified power spectrum, is studied. In particular, the so-called power-law noise is addressed, which is one of most adopted...

Parallel Generation of Pseudo-Random Sequences

Pseudo Random Numbers: Generation and Quality Checks

c © 2002 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...